Using Inductive Counting to Simulate Nondeterministic Computation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nondeterministic Structure of Computation

Divergence and nondeterminism play a fundamental role in the theory of computation. Their combined effect on computational equality deserves further study. By looking at the issue from the point of view of both computation and interaction, one is led to a canonical equality for nondeterministic computation, revealing its rich algebraic structure. The structure is studied in three ways. Firstly ...

متن کامل

Nondeterministic NC1 Computation

We deene the counting classes #NC 1 , GapNC 1 , PNC 1 and C = NC 1. We prove that boolean circuits, algebraic circuits, programs over non-deterministic nite automata, and programs over constant integer matrices yield equivalent deenitions of the latter three classes. We investigate closure properties. We observe that #NC 1 #L, that PNC 1 L, and that C = NC 1 L. Then we exploit our nite automato...

متن کامل

Efficient Parallel Computation to Simulate Blood Flow

Hemodynamic simulation is becoming an important tool for the understanding of endovascular diseases. The goal of this PhD dissertation is to provide a parallel, fast, and robust numerical solver of blood flow dynamic that interfaces easily with medical imaging. One of the necessary components of this project is to guarantee reliability, performance and portability of the blood flow simulation c...

متن کامل

Inductive Counting below LOGSPACE

We apply the inductive counting technique to nondetermin-istic branching programs and prove that complementation on this model can be done without increasing the width of the branching programs too much. This shows that for an arbitrary space bound s(n), the class of languages accepted by nonuniform nondeterministic O(s(n)) space bounded Turing machines is closed under complementation. As a con...

متن کامل

Inductive Counting below LOGSPACECarsten

Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1993

ISSN: 0890-5401

DOI: 10.1006/inco.1993.1004